# P1304 哥德巴赫猜想
# import math
# n = int(input())
# def Judgment(num):
#     if num <= 3:
#         return True
#     else:
#         flag = None
#         for i in range(2,int(math.sqrt(num))+1):
#             if num % i == 0:
#                 flag = False
#                 break
#             else:
#                 flag = True
#         return flag
# def gold(temp):
#     for k in range(2, temp + 1):
#         if Judgment(k) and Judgment(temp - k):
#             print(f"{temp}={k}+{temp - k}")
#             break
# for j in range(4,n+1,2):
#     gold(j)



# P1320 压缩技术（续集版）
# lst = []
# ls = input().strip()
# lst.append(len(ls))
# for i in range(len(ls)-1):
#     ls+=input().strip()
#
# cnt = 0
# num = 0
# for i in range(len(ls)):
#     if int(ls[i]) == num:
#         cnt+=1
#     else:
#         lst.append(cnt)
#         num = int(ls[i])
#         cnt = 1
# lst.append(cnt)
# for i in lst:
#     print(i, end=' ')



# P1321 单词覆盖还原




